An Improved Integer <i>L</i>-Shaped Method for the Vehicle Routing Problem with Stochastic Demands

We present an improved integer L-shaped method for the vehicle routing problem with stochastic demands. It exhibits speedups up to a factor of 325 compared current state-of-the-art, which allows us solve 153 previously unsolved benchmark instances optimality. The algorithm builds on state-of-the-art in few ways. First, we rectify technical issues found literature. Second, improve valid inequalities known as partial route inequalities. Finally, introduce three new types History: Accepted by Andrea Lodi, Area Editor Design &amp; Analysis Algorithms–Discrete. Supplemental Material: online appendices are available at https://doi.org/10.1287/ijoc.2023.1271 .